-
1 context-sensitive matrix language
контекстно-залежна матрична моваEnglish-Ukrainian dictionary of microelectronics > context-sensitive matrix language
-
2 language
- advanced Boolean expression language
- advanced continuous simulation language
- application control language
- application data description language
- asynchronous circuit design language
- basic design language for structure
- behavioral description language
- behavioral modeling language
- block diagram language
- block structured language
- computer language
- computer design language
- computer-sensitive language
- context-sensitive matrix language
- continuous system modeling program language
- continuous system simulation language
- control and simulation language
- data асcess system language
- declarative language
- design language
- digital design language
- formal layout description language
- general-purpose language
- geometrical layout description language
- graphics-oriented language
- hardware description language
- hierarchical specification language
- high-level language
- imperative language
- integrated-circuit design language
- linear information processing language
- linkage control language
- logic, timing, sequencing language
- low-level language
- machine-dependent language
- machine-independent language
- modeling language
- modular language
- multilevel-architecture description language
- network description language
- network restructuring language
- nonprocedural language
- operating-system simulation language
- operational control language
- operator-oriented language
- overview language
- parallel context-free array language
- problem-oriented language
- procedural language
- program assembly language
- rational language
- real-time language
- register transfer level language
- self-extending language
- structured design language
- structure description language
- symbolic layout description language
- type 0 1, 2, 3 language
- type 0 language
См. также в других словарях:
Matrix grammar — A matrix grammar is a formal grammar in which instead of single productions, productions are grouped together into finite sequences. A production cannot be applied separately, it must be applied in sequence. In the application of such a sequence… … Wikipedia
Controlled grammar — Controlled grammars[1] are a class of grammars that extend, usually, the context free grammars with additional controls on the derivations of a sentence in the language. A number of different kinds of controlled grammars exist, the four main… … Wikipedia
literature — /lit euhr euh cheuhr, choor , li treuh /, n. 1. writings in which expression and form, in connection with ideas of permanent and universal interest, are characteristic or essential features, as poetry, novels, history, biography, and essays. 2.… … Universalium
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
Computer security compromised by hardware failure — is a branch of computer security applied to hardware. The objective of computer security includes protection of information and property from theft, corruption, or natural disaster, while allowing the information and property to remain accessible … Wikipedia
List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… … Wikipedia
Liste De Problèmes NP-Complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive … Wikipédia en Français
Liste de problemes NP-complets — Liste de problèmes NP complets Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets,… … Wikipédia en Français
Liste de problèmes NP-complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problème de décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive. La … Wikipédia en Français
Liste de problèmes np-complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive … Wikipédia en Français
Regulated rewriting — is a specific area of formal languages studying grammatical systems which are able to take some kind of control over the production applied in a derivation step. For this reason, the grammatical systems studied in Regulated Rewriting theory are… … Wikipedia
